minimum completeness

minimum completeness
French\ \ perfection minimum
German\ \ minimale Vollständigkeit
Dutch\ \ minimale volledigheid (van een klasse van beslisfuncties)
Italian\ \ il minimo della completezza
Spanish\ \ lo completo mínimo
Catalan\ \ mínima completesa
Portuguese\ \ completude mínima
Romanian\ \ -
Danish\ \ -
Norwegian\ \ -
Swedish\ \ minimal fullständighet
Greek\ \ ελάχιστη πληρότητα
Finnish\ \ minimi täydellisyys
Hungarian\ \ minimális teljesség
Turkish\ \ en küçük tamlık
Estonian\ \ vähim täielikkus
Lithuanian\ \ minimalus užbaigtumas
Slovenian\ \ -
Polish\ \ minimalna kompletność
Russian\ \ минимальная завершенность
Ukrainian\ \ -
Serbian\ \ -
Icelandic\ \ lágmarki tæmandi
Euskara\ \ gutxieneko osotasun
Farsi\ \ -
Persian-Farsi\ \ -
Arabic\ \ اقل كمال
Afrikaans\ \ minimum volledigheid (van 'n klas beslissingsfunksies)
Chinese\ \ 最 小 完 全 性
Korean\ \ 최소완비성

Statistical terms. 2014.

Игры ⚽ Нужно решить контрольную?

Look at other dictionaries:

  • Completeness (statistics) — In statistics, completeness is a property of a statistic in relation to a model for a set of observed data. In essence, it is a condition which ensures that the parameters of the probability distribution representing the model can all be… …   Wikipedia

  • Minimum k-cut — In mathematics, the minimum k cut, is a combinatorial optimization problem that requires finding a set of edges whose removal would partition the graph to k connected components. These edges are referred to as k cut. The goal is to find the… …   Wikipedia

  • Turing completeness — For the usage of this term in the theory of relative computability by oracle machines, see Turing reduction. In computability theory, a system of data manipulation rules (such as an instruction set, a programming language, or a cellular… …   Wikipedia

  • analysis — /euh nal euh sis/, n., pl. analyses / seez /. 1. the separating of any material or abstract entity into its constituent elements (opposed to synthesis). 2. this process as a method of studying the nature of something or of determining its… …   Universalium

  • T-norm fuzzy logics — are a family of non classical logics, informally delimited by having a semantics which takes the real unit interval [0, 1] for the system of truth values and functions called t norms for permissible interpretations of conjunction. They are mainly …   Wikipedia

  • Feedback vertex set — In the mathematical discipline of graph theory, a feedback vertex set of a graph is a set of vertices whose removal leaves a graph without cycles. In other words, each feedback vertex set contains at least one vertex of any cycle in the graph.… …   Wikipedia

  • Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… …   Wikipedia

  • Degree-constrained spanning tree — In graph theory, a degree constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree constrained spanning tree problem is to determine whether a particular graph has such a spanning …   Wikipedia

  • Vertex cover — In the mathematical discipline of graph theory, a vertex cover of a graph is a set of vertices such that each edge of the graph is incident to at least one vertex of the set. The problem of finding a minimum vertex cover is a classical… …   Wikipedia

  • Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive …   Wikipédia en Français

  • Liste de problemes NP-complets — Liste de problèmes NP complets Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets,… …   Wikipédia en Français

Share the article and excerpts

Direct link
… Do a right-click on the link above
and select “Copy Link”